منابع مشابه
Fast k-means algorithm clustering
k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is large (for example more than 500millions of points). We propose a two stage algorithm to reduce the time cost of distance calculation for huge ...
متن کاملHow Neoliberalism Is Shaping the Supply of Unhealthy Commodities and What This Means for NCD Prevention
Alcohol, tobacco, and unhealthy foods contribute greatly to the global burden of non-communicable disease (NCD). Member states of the World Health Organization (WHO) have recognized the critical need to address these three key risk factors through global action plans and policy recommendations. The 2013-2020 WHO action plan identifies the need to engage economic, agricultural and other relevant...
متن کاملThe Complexity of the k-means Method
The k-means method is a widely used technique for clustering points in Euclidean space. While it is extremely fast in practice, its worst-case running time is exponential in the number of data points. We prove that the k-means method can implicitly solve PSPACE-complete problems, providing a complexity-theoretic explanation for its worst-case running time. Our result parallels recent work on th...
متن کاملOn Lloyd’s k-means Method∗
We present polynomial upper and lower bounds on the number of iterations performed by Lloyd’s method for k-means clustering. Our upper bounds are polynomial in the number of points, number of clusters, and the spread of the point set. We also present a lower bound, showing that in the worst case the k-means heuristic needs to perform Ω(n) iterations, for n points on the real line and two center...
متن کاملFast, single-pass K-means algorithms
We discuss the issue of how well K-means scales to large databases. We evaluate the performance of our implementation of a scalable variant of K-means, from Bradley, Fayyad and Reina (1998b), that uses several, fairly complicated, types of compression to t points into a xed size buuer, which is then used for the clustering. The running time of the algorithm and the quality of the resulting clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2004
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-004-1127-9